Paired ions: Dipolar pairs as subset of diffusion pairs
نویسندگان
چکیده
منابع مشابه
Kidney paired donation with compatible pairs.
We read with great interest the article Gentry et al. (1) which explores the impact of expanding kidney paired donation (KPD) through participation by compatible pairs. In their abstract they argue that this is a new paradigm of KPD and in their conclusion they indicate that the inclusion of recipients with compatible donors will greatly increase the number of incompatible pairs matched through...
متن کاملGrover search with pairs of trapped ions
The desired interference required for quantum computing may be modified by the wave function oscillations for the implementation of quantum algorithms[Phys.Rev.Lett.84(2000)1615]. To diminish such detrimental effect, we propose a scheme with trapped ion-pairs being qubits and apply the scheme to the Grover search. It can be found that our scheme can not only carry out a full Grover search, but ...
متن کاملContracts as Pairs of Projections
Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. Recently Findler and Felleisen have shown how to add contracts to higher-order functional languages, allowing programmers to assert invariants about functions as values. In this paper, we develop a model for such contracts. Specifically, we follow Dana Scott’s pro...
متن کاملExpanding kidney paired donation through participation by compatible pairs.
In kidney paired donation (KPD), incompatible pairs exchange kidneys so that each recipient receives a compatible organ. This modality is underutilized partly because of the difficulty of finding a suitable match among incompatible pairs. Alternatively, recipients with compatible donors might enter KPD arrangements in order to be matched with a donor predicted to give greater allograft durabili...
متن کاملFlippable Pairs and Subset Comparisons in Comparative Probability Orderings
We show that every additively representable comparative probability order on n atoms is determined by at least n − 1 binary subset comparisons. We show that there are many orders of this kind, not just the lexicographic order. These results provide answers to two questions of Fishburn et al (2002). We also study the flip relation on the class of all comparative probability orders introduced by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1978
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.75.1.16